Optimal IR How Far Away%3F

Thai Visually Impaired%27s Requirements to Access Mathematics Via an Automatic Math Reader.

Computer Support for Mathematical Word Problem Solving %2D Guided by Thai Teachers%27 Views.

Principles%2C Applications%2C and Trends of Granular Computing.

SignMT An alternative language learning tool.

Bayesian network modeling for evolutionary genetic structures.



Advances in Knowledge Discovery and Data Mining

Local Triplet Pattern for Content%2DBased Image Retrieval.

Efficient image retrieval in DCT domain by hypothesis testing.

Compiling Multiply Sectioned Bayesian Networks A Comparative Study.

Granular Computing%2C Principles and Perspectives of.

Fault%2DTolerant Multi%2DAgent Exact Belief Propagation.

Lexical acquisition and clustering of word senses to conceptual lexicon construction.

Distributed parallel compilation of MSBNs.

Uncertain inference control in privacy protection.

Uncertain inference control in privacy protection.

Advanced Data Mining and Applications
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Mining Causal Knowledge from Diagnostic Knowledge.

A Distributed Multi%2Dagent System implementation of the Human%2DFriendly MAS for Mining Stock Data.

Integrating rough set theory and medical applications.

Adaptable learning assistant for item bank management.

Intelligent Thai text %2D Thai sign translation for language learning.

Focus to emphasize tone analysis for prosodic generation.

Applying the extended mass%2Dconstraint EM algorithm to image retrieval.

Applying the extended mass%2Dconstraint EM algorithm to image retrieval.

A foundation of rough sets theoretical and computational hybrid intelligent system for survival analysis.

Dynamic multiagent probabilistic inference.

Rough Sets and Knowledge Technology
Abstract. A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an attribute reduct is presented. Specifically, we discuss the following issues: First, there are a variety of properties that can be observed in an information table. Second, the preservation of a certain property by an attribute set can be evaluated by different measures, defined as different fitness functions. Third, by considering the monotonicity property of a particular fitness function, the reduct construction method needs to be carefully examined. By adopting different heuristics or fitness functions for preserving a certain property, one is able to derive most of the existing definitions of a reduct. The analysis brings new insight into the problem of reduct construction, and provides guidelines for the design of new algorithms.
Addressing Missing Attributes during Data Mining Using Frequent Itemsets and Rough Set Based Predictions.

A Method of Finding Representative Sets of Rules.

Discovering Hierarchical Patterns of Students%27 Learning Behavior in Intelligent Tutoring Systems.

A Rough Set Based Map Granule.

Constructing Associative Classifiers from Decision Tables.

Constructing Associative Classifiers from Decision Tables.



Keyword Extraction Strategy for Item Banks Text Categorization.

Rule Evaluations%2C Attributes%2C and Rough Sets Extension and a Case Study.

Hybrid Rough Sets%2DPopulation Based System.

Hybrid Rough Sets Intelligent System Architecture for Survival Analysis.

Segment%2DBased Hidden Markov Models for Information Extraction.
Hidden Markov models (HMMs) are powerful statistical models that have found successful applications in Information Extraction (IE). In current approaches to applying HMMs to IE, an HMM is used to model text at the document level. This modelling might cause undesired redundancy in extraction in the sense that more than one filler is identified and extracted. We propose to use HMMs to model text at the segment level, in which the extraction process consists of two steps: a segment retrieval step followed by an extraction step. In order to retrieve extractionrelevant segments from documents, we introduce a method to use HMMs to model and retrieve segments. Our experimental results show that the resulting segment HMM IE system not only achieves near zero extraction redundancy, but also has better overall extraction performance than traditional document HMM IE systems. 1
Auditing and Inference Control for Privacy Preservation in Uncertain Environments.


Rule analysis with rough sets theory.




Iterative Multiagent Probabilistic Inference.

A Bayesian Network Approach to Detecting Privacy Intrusion.

Privacy intrusion detection using dynamic Bayesian networks.

Probabilistic Internal Privacy Intrusion Detection.

Dynamic inference control in privacy preference enforcement.

Temporal Context Lie Detection and Generation.

DalTREC 2006 QA System Jellyfish Regular Expressions Mark%2Dand%2DMatch Approach to Question Answering.

Web Intelligence Meets Brain Informatics at the Language Barrier A Procrustean Bed%3F

Reasoning about obfuscated private information who have lied and how to lie.

Privacy Preserving Multiagent Probabilistic Reasoning about Ambiguous Contexts A Case Study.

Rule learning Ordinal prediction based on rough sets and soft%2Dcomputing.

Introducing a Rule Importance Measure.

Introducing a Rule Importance Measure.

Spelling Recognition for Two Commonly%2DUsed Thai Spelling Methods.

Spelling Recognition for Two Commonly%2DUsed Thai Spelling Methods.

Hybrid Intelligent Systems Selecting Attributes for Soft%2DComputing Analysis.

Recovering %22Lack of Words%22 in Text Categorization for Item Banks.

A Probabilistic Evaluation Function for Relaxed Unification.

Discovering and ranking important rules.

TSTMT step towards an accurate Thai sign translation.

PKIP Feature Selection in Text Categorization for Item Banks.


A Rough Set Based Model to Rank the Importance of Association Rules.
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, interesting and important. We introduce a rough set based process by which a rule importance measure is calculated for association rules to select the most appropriate rules. We use ROSETTA software to generate multiple reducts. Apriori association rule algorithm is then applied to generate rule sets for each data set based on each reduct. Some rules are generated more frequently than the others among the total rule sets. We consider such rules as more important. We define rule importance as the frequency of an association rule among the rule sets. Rule importance is different from rule interestingness in that it does not consider the predefined knowledge on what kind of information is considered to be interesting. The experimental results show our method reduces the number of rules generated and at the same time provides a measure of how important is a rule.
Selecting Attributes for Soft%2DComputing Analysis in Hybrid Intelligent Systems.


Thai Spelling Recognition Using a Continuous Speech Corpus.

Thai Syllable%2DBased Information Extraction Using Hidden Markov Models.

Intelligent Query Answering Based on Neighborhood Systems and Data Mining Techniques.

N%2DGram%2DBased Detection of New Malicious Code.
The current commercial anti-virus software detects a virus only after the virus has appeared and caused damage. Motivated by the standard signature-based technique for detecting viruses, and a recent successful text classification method, we explore the idea of automatically detecting new malicious code using the collected dataset of the benign and malicious code. We obtained accuracy of 100 % in the training data, and 98 % in 3-fold cross-validation. 1
Revising Markov Boundary for Multiagent Probabilistic Inference.

Intelligent Query Answering Based on Neighborhood Systems and Data Mining Techniques.

Dual Problems Attribute Selection and Example Selection.

Probabilistic reasoning in dynamic multiagent systems.
Probabilistic reasoning with multiply sectioned Bayesian networks  (MSBNs) has been successfully applied in static domains  under the cooperative multiagent paradigm. Probabilistic  reasoning in dynamic domains under the same  paradigm involves several issues. This paper proposes an approach  to address these issues. Intuitively, observation on current  state plays a more important role in the reasoning of the  current state than remote historic information. Based on the  intuition, we model the entire domain for a period of time into  an MSBN and then reason about the state of the dynamic domain  period by period exactly. In reasoning the state of a suspected  entity, we compute and observe an observable Markov  boundary of the entity. This makes observation more efficient  and relevant. In MSBNs, an observable Markov boundary of  a node may span across all Bayesian subnets. We present  an algorithm for cooperative computation of an observable  Markov boundary of a set of nodes in MSBNs without revealing  subnet structures. Preliminary experiments show the  approach works well on our simulated multiagent dynamic  domains.
Applying Association Rules for Interesting Recommendations Using Rule Templates.

Detection of New Malicious Code Using N%2Dgrams Signatures.
Abstract — Signature-based malicious code detection is the standard technique in all commercial anti-virus software. This method can detect a virus only after the virus has appeared and caused damage. Signature-based detection performs poorly when attempting to identify new viruses. Motivated by the standard signature-based technique for detecting viruses, and a recent successful text classification method, n-grams analysis, we explore the idea of automatically detecting new malicious code. We employ n-grams analysis to automatically generate signatures from malicious and benign software collections. The n-gramsbased signatures are capable of classifying unseen benign and malicious code. The datasets used are large compared to earlier applications of n-grams analysis.
A Weighted Freshness Metric for Maintaining Search Engine Local Repository.

Experiments in Web Page Classification for Semantic Web.

PPDN %2D a Framework for Peer%2Dto%2DPeer Collaborative Research Network.

A data warehouse%2Fonline analytic processing framework for web usage mining and business intelligence reporting.

Toward better scoring metrics for pseudo%2Dindependent models.

Feature Selection with Rough Sets for Web Page Classification.
Abstract. Web page classification is the problem of assigning predefined categories to web pages. A challenge in web page classification is how to deal with the high dimensionality of the feature space. We present a feature reduction method based on the rough set theory and investigate the effectiveness of the rough set feature selection method on web page classification. Our experiments indicate that rough set feature selection can improve the predictive performance when the original feature set for representing web pages is large. 1
Discovering Cyber Communities from the WWW.

Session Boundary Detection for Association Rule Learning Using n%2DGram Language Models.
We present a statistical method using n-gram language models  to identify session boundaries in a large collection of Livelink log data.
Towards the Theory of Relaxed Unification.
Abstract. Classical unification is strict in the sense that it requires a perfect agreement between the terms being unified. In practice, data is seldom error-free and can contain inconsistent information. Classical unification fails when the data is imperfect. Fuzzy unification partially addresses uncertainty but requires the creation of fuzzy databases. We propose the Theory of Relaxed Unification as a new theory that relaxes the constraints of classical unification without requiring special pre-processing of data. The goal of relaxed unification is to tolerate possible errors and inconsistencies in the data and facilitate reasoning under uncertainty. The Theory of Relaxed Unification is more general and has higher expressive power than the classical Theory of Unification. We present the fundamental concepts of relaxed unification, a relaxed unification algorithm, and a number of examples. 1
Relaxed unification%2D%2DProposal.

Applying Machine Learning to Text Segmentation for Information Retrieval.
We propose a self-supervised word segmentation technique for text segmentation in Chinese  information retrieval. This method combines the advantages of traditional dictionary  based, character based and mutual information based approaches, while overcoming many of  their shortcomings. Experiments on TREC data show this method is promising. Our method  is completely language independent and unsupervised, which provides a promising avenue  for constructing accurate multi-lingual or cross-lingual information retrieval systems that are  exible and adaptive. We  nd that although the segmentation accuracy of self-supervised  segmentation is not as high as some other segmentation methods, it is enough to give comparable  (in some cases even better) retrieval performance. It is commonly believed that word  segmentation accuracy is monotonically related to retrieval performance in Chinese information  retrieval. However, for Chinese, we  nd that the relationship between segmentation and  retrieval performance is in fact nonmonotonic; that is, at around 70% word segmentation  accuracy an over-segmentation phenomenon begins to occur which leads to a reduction in  information retrieval performance. We demonstrate this eect by presenting an empirical  investigation of information retrieval on Chinese TREC data, using a wide variety of word  segmentation algorithms with word segmentation accuracies ranging from 44% to 95%, including  70% word segmentation accuracy from our self-supervised word-segmentation approach.
A visualization model of interactive knowledge discovery systems and its implementations.

Simulation of Graphical Models for Multiagent Probabilistic Inference.

Comparison of interestingness functions for learning web usage patterns.

Relaxed Unification %2D Proposal.

Discovery of Interesting Association Rules from Livelink Web Log Data.

Interactive Construction of Classification Rules.

Using self%2Dsupervised word segmentation in Chinese information retrieval.
We propose a self-supervised word-segmentation technique for Chinese information retrieval. This method combines the advantages of traditional dictionary based approaches with character based approaches, while overcoming many of their shortcomings. Experiments on TREC data show comparable performance to both the dictionary based and the character based approaches. However, our method is language independent and unsupervised, which provides a promising avenue for constructing accurate multilingual information retrieval systems that are flexible and adaptive.
Introduction to the Special Issue.

Generate and Repair Machine Translation.
Abstract. A novel multi-phase architecture for an accurate machine translation system is proposed. The system is divided into three phases: quick and dirty machine translation (QDMT), conceptual comparison and repair and iterate. QDMT generates the appropriate translation candidates (TCs) in the target language for the input sentence in the source language. Next, the system compares the meaning of the TC with that of the input sentence. If there is dissimilarity in meaning between the TC and the input sentence, the most appropriate TC will then be ÒrepairedÓ. To demonstrate this approach, a translation system which translates from English to Thai has been developed. In this paper, QDMT is described and initial experiments with QDMT are presented. Some concluding remarks are made with respect to completion of the first phase. 1.
From Computational Intelligence to Web Intelligence.

Editorial Notes.

Proceedings of the 2001 IEEE International Conference on Data Mining
Text clustering typically involves clustering in a high dimensional space, which appears difficult with regard to virtually all practical settings. In addition, given a particular
A Case Study for Learning from Imbalanced Data Sets.

Interactive Construction of Decision Trees.
Decision trees are commonly used for classification. We propose to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because visualizing the decision tree can reveal much valuable information in the data. We introduce PaintingClass, a system for interactive construction, visualization and exploration of decision trees. PaintingClass provides an intuitive layout and convenient navigation of the decision tree. PaintingClass also provides the user the means to interactively construct the decision tree. Each node in the decision tree is displayed as a visual projection of the data. Through actual examples and comparison with other classification methods, we show that the user can effectively use PaintingClass to construct a decision tree and explore the decision tree to gain additional knowledge.
From Computational Intelligence to Web Intelligence An Ensemble from Potpourri.

Implementation Issues and Paradigms of Visual KDD Systems.

Rule Quality Measures for Rule Induction Systems Description and Evaluation.

Discovering Maximal Generalized Decision Rules Through Horixontal and Vertical Data Reduction.

CViz An Interactive Visualization System for Rule Induction.

Learning Pseudo%2Dindependent Models Analytical and Experimental Results.
. Most algorithms to learn belief networks use single-link lookahead  search to be efficient. It has been shown that such search procedures  are problematic when applied to learning pseudo-independent (PI) models.  Furthermore, some researchers have questioned whether PI models  exist in practice.  We present two non-trivial PI models which derive from a social study  dataset. For one of them, the learned PI model reached ultimate prediction  accuracy achievable given the data only, while using slightly more  inference time than the learned non-PI model. These models provide  evidence that PI models are not simply mathematical constructs.  To develop efficient algorithms to learn PI models effectively we benefit  from studying and understanding such models in depth. We further analyze  how multiple PI submodels may interact in a larger domain model.  Using this result, we show that the RML algorithm for learning PI models  can learn more complex PI models than previously known.  Keywor...
Typical Example Selection for Learning Classifiers.

Rule Quality Measures Improve the Accuracy of Rule Induction An Experimental Approach.

RuleViz a model for visualizing knowledge discovery process.

AViz A Visualization System for Discovering Numeric Association Rules.

Supervised Learning A Generalized Rough Set Approach.

Introduction To the Special Issue on the 1999 Pacific Association for Computational Linguistics Conference.

Probability%2DBased Chinese Text Processing and Retrieval.

Visualizing the process of knowledge discovery.

ORTES The Design of a Real%2DTime Control Expert System.

Learning English Grapheme Segmentation Using the Iterated Version Space Algorithm.
Abstract. Our unique approach for learning English grapheme segmentation (LE-GS) rules using the Iterated Version Space Algorithm (IVSA) is presented. After de ning the problem and our representation for the instances and hypotheses, we illustrate the LE-GS approach by tracing a speci c example. Experimental results, based on a ten-fold testing methodology, are given to show the performance of the LE-GS learning system. 1
DVIZ A System for Visualizing Data Mining.

Discretization of Continuous Attributes for Learning Classification Rules.

The Iterated Version Space Learning.

An Empirical Study on Rule Quality Measures.

English%2DThai Translation Initial Experiments with a Multiphase Translation System.

Rule%2DInduction and Case%2DBased Reasoning Hybrid Architectures Appear Advantageous.

Data Mining in Large Databases Using Domain Generalization Graphs.
Attribute-oriented generalization summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to userdefined concept hierarchies. We introduce domain generalization graphs for controlling the generalization of a set of attributes and show how they are constructed. We then present serial and parallel versions of the Multi-Attribute Generalization algorithm for traversing the generalization state space described by joining the domain generalization graphs for multiple attributes. Based upon a generate-and-test approach, the algorithm generates all possible summaries consistent with the domain generalization graphs. Our experimental results show that significant speedups are possible by partitioning path combinations from the DGGs across multiple processors. We also rank the interestingness of the resulting summaries using measures based upon variance and relative entropy. Our experimental results also show that these measures provide an effective basis for analyzing summary data generated from relational databases. Variance appears more useful because it tends to rank the less complex summaries (i.e., those with few attributes and/or tuples) as more interesting.
Data Mining via Discretization%2C Generalization and Rough Set Feature Selection.

ELEM2 A Learning System for More Accurate Classifications.

Mining Market Basket Data Using Share Measures and Characterized Itemsets.
We propose the share-confidence framework for knowledge  discovery from databases which addresses the problem of mining itemsets  from market basket data. Our goal is two-fold: (1) to present new  itemset measures which are practical and useful alternatives to the commonly  used support measure; (2) to not only discover the buying patterns  of customers, but also to discover customer profiles by partitioning customers  into distinct classes. We present a new algorithm for classifying  itemsets based upon characteristic attributes extracted from census or  lifestyle data. Our algorithm combines the Apriori algorithm for discovering  association rules between items in large databases, and the AOG  algorithm for attribute-oriented generalization in large databases. We  suggest how characterized itemsets can be generalized according to concept  hierarchies associated with the characteristic attributes. Finally, we  present experimental results that demonstrate the utility of the shareconfidence  framework.  1 
Mining Association Rules from Market Basket Data using Share Measures and Characterized Itemsets.
The problem of mining association rules from market basket data has recently been an important research topic in the area of knowledge discovery from databases. It was originally introduced in [2] and studied extensively in [1, 5, 25, 26, 31, 19, 23, 29, 30, 3, 4, 33, 14]. The problem is typically examined in the context of discovering buying patterns from retail sales transactions. Although there are many similar data mining applications which can be modelled in this way, we again study the problem using the retail store example because of its intuitive nature and clarity. Consider a retail sales operation with a large inventory consisting of many different products. The operation is situated in a location where the customer base is socio-economically diverse, with annual household incomes ranging from very low to very high, and demographically ranging from young families to the elderly. The sales manager has used data mining to search for association ru...
Inducing and Using Decision Rules in the GRG Knowledge Discovery System.

Integrating Rule Induction and Case%2DBased Reasoning to Enhance Problem Solving.

Learning Maximal Generalized Decision Rules via Discretization

Share Based Measures for Itemsets.

Parallel Knowledge Discovery Using Domain Generalization Graphs.
Multi-Attribute Generalization is an algorithm for attributeoriented  induction in relational databases using domain generalization  graphs. Each node in a domain generalization graph represents a different  way of summarizing the domain values associated with an attribute.
Applying Knowledge Discovery to Predict Water%2DSupply Consumption.

A %60%60Microscopic%27%27 Study of Minimum Entropy Search in Learning Decomposable Markov Networks.
Several scoring metrics are used in different search procedures for learning probabilistic networks. We study the properties of cross entropy in learning a decomposable Markov network. Though entropy and related scoring metrics were widely used, its `microscopic&#039; properties and asymptotic behavior in a search have not been analyzed. We present such a `microscopic&#039; study of a minimum entropy search algorithm, and show that it learns an I-map of the domain model when the data size is large. Search procedures that modify a network structure one link at a time have been commonly used for efficiency. Our study indicates that a class of domain models cannot be learned by such procedures. This suggests that prior knowledge about the problem domain together with a multi-link search strategy would provide an effective way to uncover many domain models.  Keywords: Inductive learning, reasoning under uncertainty, knowledge acquisition, Markov networks, probabilistic networks. 1 Introduction  A pr...
Mining Knowledge Rules from Databases A Rough Set Approach.

Attribute%2Doriented Induction Using Domain Generalization Graphs.
Attribute-oriented induction summarizes the information in a relational database by repeatedly replacing specific attribute values with more general concepts according to user-defined concept hierarchies. We show how domain generalization graphs can be constructed from multiple concept hierarchies associated with an attribute, describe how these graphs can be used to control the generalization of a set of attributes, and present the Multi-Attribute Generalization algorithm for attributeoriented induction using domain generalization graphs. Based upon a generate-and-test approach, the algorithm generates all possible combinations of nodes from the domain generalization graphs associated with the individual attributes, to produce all possible generalized relations for the set of attributes. We rank the interestingness of the resulting generalized relations using measures based upon relative entropy and variance. Our experiments show that these measures provide a basis for analyzing summary data from relational databases. Variance appears more useful because it tends to rank the less complex generalized relations (i.e., those with few attributes and/or few tuples) as more interesting.  1 
Induction of Classification Rules from Imperfect Data.

Rule Discovery from Databases with Decision Matrices.

Discovering Classification Knowledge in Databases Using Rough Sets.

Critical Remarks on Single Link Search in Learning Belief Networks.
In learning belief networks, the single link lookahead search is widely adopted to reduce the search space. We show that there exists a class of probabilistic domain models which displays a special pattern of dependency. We analyze the behavior of several learning algorithms using different scoring metrics such as the entropy, conditional independence, minimal description length and Bayesian metrics. We demonstrate that single link lookahead search procedures (employed in these algorithms) cannot learn these models correctly. Thus, when the underlying domain model actually belongs to this class, the use of a single link search procedure will result in learning of an incorrect model. This may lead to inference errors when the model is used. Our analysis suggests that if the prior knowledge about a domain does not rule out the possible existence of these models, a multi-link lookahead search or other heuristics should be used for the learning process. 1 INTRODUCTION  As many effective pr...
Intelligent Query Answering by Knowledge Discovery Techniques.
Knowledge discovery facilitates querying database knowledge and intelligent query answering in database systems. In this paper, we investigate the application of discovered knowledge, concept hierarchies, and knowledge discovery tools for intelligent query answering in database systems. A knowledge-rich data model is constructed to incorporate discovered knowledge and knowledge discovery tools. Queries are classified into data queries and knowledge queries. Both types of queries can be answered directly by simple retrieval or intelligently by analyzing the intent of query and providing generalized, neighborhood or associated information using stored or discovered knowledge. Techniques have been developed for intelligent query answering using discovered knowledge and/or knowledge discovery tools, which includes generalization, data summarization, concept clustering, rule discovery, query rewriting, deduction, lazy evaluation, application of multiplelayered databases, etc. Our study shows that knowledge discovery substantially broadens the spectrum of intelligent query answering and may have deep implications on query answering in data- and knowledge-base systems.
Rough Sets Similarity%2DBased Learning from Databases.

Using Rough Sets as Tools for Knowledge Discovery.

Learning in Relational Databases A Rough Set Approach.

Quantification of Unvertainty in Classification Rules Discovered from Databases.

A Knowledge%2Dbased System for Generating Informative Responsens to Indirect Database Queries.

Discovery of Decision Rules in Relational Databases A Rough Set Approach.

DBROUGH A Rough Set Based Knowledge Discovery System.

Learning Data Trend Regularities From Databases in a Dynamic Environment.

Object%2DOriented Modelling and Simulation of an Expert System for Monitoring and Control of a Water Distribution System.

DBLearn A System Prototype for Knowledge Discovery in Relational Databases.

Decision%2DTheoretic Salience Interactions in Language Generation.

Human%2DComputer Interfaces DBLEARN and System X.

Quantifying Uncertainty of Knowledge Discovered From Databases.

An Attribute%2DOriented Rough Set Approach for Knowledge Discovery in Databases.
Knowledge Discovery in Databases (KDD) is an active research area with the promise for a high payoff in many business and scientific applications. The grand challenge of knowledge discovery in databases is to automatically process large quantities of raw data, identify the most significant and meaningful patterns, and present this knowledge in an appropriate form for achieving the user&#039;s goal. Knowledge discovery systems face challenging problems from the real-world databases which tend to be very large, redundant, noisy and dynamic. Each of these problems has been addressed to some extent within machine learning, but few, if any, systems address them all. Collectively handling these problems while producing useful knowledge efficiently and effectively is the main focus of the thesis. In this thesis, we develop an attribute-oriented rough set approach for knowledge discovery in databases. The method adopts the artificial intelligent &#034;learning from examples&#034; paradigm combined with rough...
Data%2DDriven Discovery of Quantitative Rules in Relational Databases.
A quantitative rule is a rule associated with quantitative information which assesses the representativehess of the rule in the database. In this paper, an efficient induction method is developed for learuing quantitative rules in relational databases. With the assistance of knowledge about concept hierarchies, data relevance, and expected rule forms, attribute-oriented induction can be performed on the database, which integrates database operations with the learuing process and provides a simple, efficient way of learning quantitative rules from large databases. Our method learns both characteristic rules and classification rules. Quantitative information facilitates quantitative reasoning, incremental learning, and learuing in the presence of noise. Moreover, learuing qualitative rules can be treated as a special case of learuing quantitative rules. Our paper shows that attributeoriented induction provides an efficient and effective mechanism for learning various kinds of knowledge rules from relational databases.
Guest Editors%27 Introduction.

Knowledge Discovery in Databases An Attribute%2DOriented Approach.
Knowledge discovery in databases, or data mining, is an important issue in the development of data- and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a machine learning paradigm, especially learning-from-examples techniques, with set-oriented database operations and extracts generalized data from actual data in databases. An attribute-oriented concept tree ascension technique is applied in generalization, which substantially reduces the computational complexity of database learning processes. Different kinds of knowledge rules, including characteristic rules, discrimination rules, quantitative rules, and data evolution regularities can be discovered efficiently using the attribute-oriented approach. In addition to learning in relational databases, the approach can be applied to knowledge discovery in nested relational and deductive databases. Learning can also be performed with databases containing noisy data and exceptional cases using database statistics. Furthermore, the rules discovered can be used to query database knowledge, answer cooperative queries and facilitate semantic query optimization. Based upon these principles, a prototyped database learning system, DBLEARN,  has been constructed for experimentation.
Introduction.
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating e ects found in other languages, such as global state, exception handling, output, or non-determinism. Three case studies are looked at in detail: how monads ease the modi cation of a simple evaluator; how monads act as the basis of a datatype of arrays subject to in-place update; and how monads can be used to build parsers.  
Attribute%2DOriented Induction in Relational Databases.
Knowledge discovery in databases, or data mining, is an important issue in the development of data- and knowledge-base systems. An attribute-oriented induction method has been developed for knowledge discovery in databases. The method integrates a machine learning paradigm, especially learning-from-examples techniques, with set-oriented database operations and extracts generalized data from actual data in databases. An attribute-oriented concept tree ascension technique is applied in generalization, which substantially reduces the computational complexity of database learning processes. Different kinds of knowledge rules, including characteristic rules, discrimination rules, quantitative rules, and data evolution regularities can be discovered efficiently using the attribute-oriented approach. In addition to learning in relational databases, the approach can be applied to knowledge discovery in nested relational and deductive databases. Learning can also be performed with databases containing noisy data and exceptional cases using database statistics. Furthermore, the rules discovered can be used to query database knowledge, answer cooperative queries and facilitate semantic query optimization. Based upon these principles, a prototyped database learning system, DBLEARN,  has been constructed for experimentation.
Learning in relational databases an attribute%2Doriented approach.

A Message to TCDE Members.

An Attribute%2DOriented Approach for Learning Classification Rules from Relational Databases.

Better Tool for Professionals Knowledge Based Systems.

Representing and Using Protosemantic Information in Generating Bus Route Descriptions.

Non%2DSingular Concepts in Natural Language Discourse.

Providing Quality Responses with Natural Language Interfaces The Null Value Problem.

What do you mean %60%60Null%27%27%3F Turning Null Responses into Quality Responses.

Accessing Knowledge through Natural Language.
Deliverable D6.4 (WP6) This deliverable describes the systematic evaluation of the integrated GATE case study testbed described in D6.3, including the evaluation of each individual transitioning step from the TAO methodology (WP1). The core of this prototype is in the GATE ontology developed semi-automatically using ontology learning tools from WP2. This ontology is used by Content Augmentation services (WP3) for the process of semantic annotation of software artefacts and service descriptions. In line with TAO’s methodology, the annotated service descriptions (as SA-WSDL) are made available for further use, such as automatic discovery by other online services. The annotated legacy content is stored in the knowledge stores developed in WP4, and made accessible to services through a query API and to human users through a text-based query interface, which hides the complexity of the underlying formal languages (e.g. SPARQL). Through this user-friendly interface we carried out a user-centric evaluation with GATE developers and users. In this way we evaluated and validated the hypothesis that the integrated TAO technology adds a new dimension to legacy open-source software which has been transitioned to ontology-based and service-based system.
A framework for computing extrasentential references.

Artificial Intelligence in Canada A Review.

An Interactive System for Finding Perfect Hash Functions.

Approaches to Knowledge Representation %2D Guest Editors%27 Introduction.

A Note on Representing Adjectives and Adverbs.

Toward a State Based Conceptual Representation.

